A New Parallel Algorithm For Fast Generation of Discrete Chebyshev Polynomials
نویسنده
چکیده
We present a new parallel algorithm for the fast generation of discrete Chebyshev polynomials. By fast we mean that the time complexity of the obtained parallel algorithm is of order O(logn), where n is the degree of the (n+1)st polynomial to be generated, and the number of available processors is assumed to be equal to a polynomial order of the input size. The parallel algorithm makes extensive use of parallel algorithms for the well-known prefix computation problem. The parallel generation of orthogonal polynomials has numerous applications in approximation theory, interpolation, and numerical analysis.
منابع مشابه
A Fast, Simple, and Stable Chebyshev-Legendre Transform Using an Asymptotic Formula
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(logN)2/ log logN) operations is derived. The basis of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the di...
متن کاملA numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملA Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملA fast FFT-based discrete Legendre transform
An O(N(logN)2/ loglogN) algorithm for computing the discrete Legendre transform and its inverse is described. The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev coefficients with a Taylor series expansion for Chebyshev polynomials about equallyspaced points in the frequency domain. Both components are based on the FFT, and as an intermediate...
متن کاملFast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk , then P coincides with CN+1 := (cos jkπ N )j,k=0. This paper presents a new fast algorithm for the computation of the matrixvector product Pa in O(N logN) arithmetical operations. The algorithm divides into a fast transform wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004